Generalized Middle-Square Method
نویسندگان
چکیده
In this paper, we generalize John von Neumann’s Middle-Square Method (MSM) to canonical number systems (CNS). Additionally, present some observations and statistical tests of the sequences generated by described generators.
منابع مشابه
Middle Square Weyl Sequence RNG
In this article, we propose a new implementation of John von Neumann’s middle square random number generator (RNG). A Weyl sequence is utilized to keep the generator running through a long period.
متن کاملA Generalized Least-Square Matrix Decomposition
Taylor & Francis makes every effort to ensure the accuracy of all the information (the “Content”) contained in the publications on our platform. However, Taylor & Francis, our agents, and our licensors make no representations or warranties whatsoever as to the accuracy, completeness, or suitability for any purpose of the Content. Any opinions and views expressed in this publication are the opin...
متن کاملOn generalized middle-level problem
Let Gn be the subgraph of the hypercube Qn induced by levels between k and n − k, where n ≥ 2k + 1 is odd. The well-known middle level conjecture asserts that G2k+1 is Hamiltonian for all k ≥ 1. We study this problem in Gn for fixed k. It is known that Gn and G 1 n are Hamiltonian for all odd n ≥ 3. In this paper we prove that also Gn is Hamiltonian for all odd n ≥ 5, and we conjecture that Gn ...
متن کاملNormalization of Contrast in Document Images Using Generalized Fuzzy Operator with Least Square Method
The visual effect of non-uniform contrast and brightness surrounds in the image is a very common problem in the applications of photocopying, IC manufacture and medicine. In using the digital/CCD camera to capture documents and photos based on non-uniform illumination condition, the poor image will be seen. The poor image can result in achieving the inaccurate reading from the optical character...
متن کاملComputing Square Roots using the Babylonian Method
We implement the Babylonian method [1] to compute square roots of numbers. We provide precise algorithms for naturals, integers and rationals, and offer an approximation algorithm for linear ordered fields.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Az Eszterházy Károly Tanárképz? F?iskola tudományos közleményei
سال: 2023
ISSN: ['1216-6014', '1787-6117', '1787-5021', '1589-6498']
DOI: https://doi.org/10.33039/ami.2022.12.003